Equivalence Classes of Latin Squares and Nets in Cp
نویسنده
چکیده
The fundamental combinatorial structure of a net in CP is its associated set of mutually orthogonal latin squares. We define equivalence classes of sets of orthogonal Latin squares by label equivalences of the lines of the corresponding net in CP. Then we count these equivalence classes for small cases. Finally, we prove that the realization spaces of these classes in CP are empty to show some non-existence results for 4-nets in CP.
منابع مشابه
Interactive Learning of Acyclic Conditional Preference Networks
Learning of user preferences, as represented by, for example, Conditional Preference Networks (CP-nets), has become a core issue in AI research. Recent studies investigate learning of CP-nets from randomly chosen examples or from membership and equivalence queries. To assess the optimality of learning algorithms as well as to better understand the combinatorial structure of classes of CP-nets, ...
متن کاملPermutation patterns in Latin squares
In this paper we study pattern avoidance in Latin squares, giving us a two dimensional analogue of the well-studied notion of pattern avoidance in permutations. Our main results include enumerating and characterizing the Latin squares which avoid patterns of length three and a generalization of the Erdős-Szekeres theorem. We also discuss equivalence classes among longer patterns, and conclude b...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملA graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
The non-existence of a pair of mutually orthogonal Latin squares of order six is a well-known result in the theory of combinatorial designs. It was conjectured by Euler in 1782 and was first proved by Tarry [4] in 1900 by means of an exhaustive enumeration of equivalence classes of Latin squares of order six. Various further proofs have since been given [1, 2, 3, 5], but these proofs generally ...
متن کاملLearning conditional preference networks
Conditional preference networks (CP-nets) have recently emerged as a popular language capable of representing ordinal preference relations in a compact and structured manner. In this paper, we investigate the problem of learning CP-nets in the well-known model of exact identification with equivalence and membership queries. The goal is to identify a target preference ordering with a binary-valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007